Implicit Constraints for Qualitative Spatial and Temporal Reasoning

نویسنده

  • Jochen Renz
چکیده

Qualitative information about spatial or temporal entities is represented by specifying qualitative relations between these entities. It is then possible to apply qualitative reasoning methods for tasks such as checking consistency of the given information, deriving previously unknown information or answering queries. Depending on the kind of information that is represented, qualitative reasoning methods might lead to incorrect results, and it is a topic of ongoing research efforts to determine when and why this occurs. In this paper we present two possible explanations for this behaviour: (1) the existence of implicit entities that we do not explicitly represent; (2) the existence of implicit constraints that have to be satisfied, but which are not explicitly represented. We show that both of these can lead to undetected inconsistencies. By making these implicit entities and constraints explicit, and by including them in the qualitative representation, we are able to solve problems that could not be solved qualitatively before. We present different examples of implicit entities and implicit constraints and an algorithm for solving them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Model for Qualitative Spatial Reasoning Combining Topology, Orientation and Distance

Much work has been done in the area of qualitative spatial reasoning over the past years, with application in various domains. However, existing models only capture particular aspects of the spatial relations between objects and therefore are unable to represent these relations accurately. In this paper, we draw together two existing approaches to provide a calculus taking into account topology...

متن کامل

Processing Qualitative Temporal Constraints

In this chapter we provide an overview of the main techniques for processing qualitative temporal constraints. We survey a collection of algorithms for solving fundamental reasoning problems in the context of Allen’s Interval Algebra, Vilain and Kautz’s Point Algebra, and of other tractable and intractable classes of temporal relations. These problems include determining the satisfiability of a...

متن کامل

Transition Constraints: A Study on the Computational Complexity of Qualitative Change

Many formalisms discussed in the literature on qualitative spatial reasoning are designed for expressing static spatial constraints only. However, dynamic situations arise in virtually all applications of these formalisms, which makes it necessary to study variants and extensions dealing with change. This paper presents a study on the computational complexity of qualitative change. More precise...

متن کامل

Combining Topological and Qualitative Size Constraints for Spatial Reasoning

Information about the relative size of spatial regions is often easily accessible and, when combined with other types of spatial information , it can be practically very useful. In this paper we combine a simple framework for reasoning about qualitative size relations with the Region Connection Calculus RCC-8, a widely studied approach for qualitative spatial reasoning with topological relation...

متن کامل

Efficient Algorithms for Qualitative Reasoning about Imprecise Space

This paper addresses the problem of qualitative spatial reasoning and presents eecient algorithms to deal it. We assume a representation which views space as a totality of objects surrounded by a haze area and connected in terms of qualitative spatial relations. Statements relating objects in this represesentation are expressed in terms of haze-order constraints. Reasoning about haze-orders inv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012